XML Data Integrity Based on Concatenated Hash Function
نویسندگان
چکیده
Data integrity is the fundamental for data authentication. A major problem for XML data authentication is that signed XML data can be copied to another document but still keep signature valid. This is caused by XML data integrity protecting. Through investigation, the paper discovered that besides data content integrity, XML data integrity should also protect element location information, and context referential integrity under fine-grained security situation. The aim of this paper is to propose a model for XML data integrity considering XML data features. The paper presents an XML data integrity model named as CSR (content integrity, structure integrity, context referential integrity) based on a concatenated hash function. XML data content integrity is ensured using an iterative hash process, structure integrity is protected by hashing an absolute path string from root node, and context referential integrity is ensured by protecting context-related elements. Presented XML data integrity model can satisfy integrity requirements under situation of fine-grained security, and compatible with XML signature. Through evaluation, the integrity model presented has a higher efficiency on digest value-generation than the Merkle hash tree-based integrity model for XML data. KeywordsFine-grained security, XML data integrity, Digest value, Merkle hash tree, XML signature.
منابع مشابه
An Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملLeakage-Free Integrity Assurance for Tree Data Structures
Data sharing with multiple parties over a third-party distribution framework requires that both data integrity and confidentiality be assured. One of the most widely used data organization structures is the tree structure. When such structures encode sensitive information (such as in the XML documents), it is crucial that integrity and confidentiality be assured not only for the content, but al...
متن کاملStructural signatures for tree data structures
Data sharing with multiple parties over a third-party distribution framework requires that both data integrity and confidentiality be assured. One of the most widely used data organization structures is the tree structure. When such structures encode sensitive information (such as in XML documents), it is crucial that integrity and confidentiality be assured not only for the content, but also f...
متن کاملDigital Signature with Hashing and XML Signature patterns
Data security has become one of the most important concerns for organizations. Information is a valuable asset and needs to be protected. One important countermeasure against attackers is the use of digital signatures. Digital signatures provides message authentication and may also provide message integrity. We present here two patterns: XML Signature and Digital Signature with Hashing patterns...
متن کاملHash Algorithm for Data Integrity based on Matrix Combination
In this paper, we propose a secure Hash Algorithm with the focus on Data Integrity. A hash function, is a function that takes some message of any length as input and transforms it into a fixed-length output called a hash value, in DILH the hash value length 1152 bits. Many types of hash functions have been defined but, the most widely used in many of the cryptographic applications currently are...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0906.3772 شماره
صفحات -
تاریخ انتشار 2009